Propositional DAGs: A New Graph-Based Language for Representing Boolean Functions
نویسندگان
چکیده
This paper continues the line of research on knowledge compilation in the context of Negation Normal Forms (NNF) and Binary Decision Diagrams (BDD). The idea is to analyze different target languages according to their succinctness and the classes of queries and transformations supported in polytime. We identify a new property called simple-negation, which is an implicit restriction of all NNFs and BDDs. The removal of this restriction leads to Propositional Directed Acyclic Graphs (PDAG), a more general family of graph-based languages for representing Boolean functions or propositional theories. With respect to certain NNF-based languages, we will show that corresponding PDAG-based languages are at least as succinct and support the same transformations. The most interesting language even supports the same queries and an additional transformation, making it more flexible.
منابع مشابه
Representing Boolean Functions with If-Then-Else DAGs
This article describes the use of binary decision diagrams (BDDs) and if-then-else dags for representing and manipulating Boolean functions. Two-cuts are de ned for binary decision diagrams, and a relationship is exhibited between general if-then-else expressions and the two-cuts of a BDD for the same function. An algorithm for computing all two-cuts of a BDD in O(n 2 ) time is given. A new can...
متن کاملA Novel Preprocessing Technique for Session Construction using Propositional DAGs
This paper continues the line of research on Web access log analysis. Web access log analysis is to analyze the patterns of web site usage and the features of users’ behavior. It is the fact that the normal Log data is very noisy and unclear and it is vital to preprocess the log data for efficient web usage mining process. Preprocessing is the process comprises of three phases which includes da...
متن کاملRepresenting Boolean Functions with Propositional Directed Acyclic Graphs
Propositional directed acyclic graphs (PDAG) continue the line of research on knowledge compilation in the context of Negational Normal Forms (NNF) and Binary Decision Diagrams (BDD). This paper summarizes previous results and open problems concerning knowledge representation based on PDAG and its sub-languages. In addition, it gives a short introduction to some application areas.
متن کاملNetwork Reliability Evaluation with Propositional Directed Acyclic Graphs1
This paper proposes a new and flexible approach for network reliability computation. The method is based on Propositional Directed Acyclic Graphs (PDAGs), a general graph-based language for the representation of Boolean functions. We introduce an algorithm which creates in polynomial time a generic structure function representation for reliability networks. In contrast to many existing methods,...
متن کاملProbabilistic Equivalence Checking with Propositional DAGs
The canonical representation of Boolean functions offered by OBDDs (ordered binary decision diagrams) allows to decide the equivalence of two OBDDs in polynomial time with respect to their size. It is still unknown, if this holds for other more succinct supersets of OBDDs such as FBDDs (free binary decision diagrams) and d-DNNFs (deterministic, decomposable negation normal forms), but it is kno...
متن کامل